Energy Packet Networks with finite capacity energy queues

Energy Packet Network (EPN) consists of a queueing network formed by N blocks, where each them is one data queue, that handles the workload, and energy packets energy. We study an EPN model start transfer. In this model, are sent to queue same block. An packet routes workload next block if not empty, it lost otherwise. assume queues have finite buffer size arrives system when full, jump-over blocking (JOB) performed, therefore with some probability first provide value such steady-state distribution in admits product form solution. The established for multiserver multiclass under FCFS, preemptive LCFS PS discipline. Moreover, case directed tree network, we show number subtree decreases as JOB increases